Variable Long-precision Arithmetic (vlpa) for Reconngurable Coprocessor Architectures Variable Long-precision Arithmetic (vlpa) for Reconngurable Coprocessor Architectures

نویسندگان

  • Alexandre Ferreira Tenca
  • Willian Newman
  • David Rennels
  • Jason Cong
  • Milos D. Ercegovac
چکیده

OF THE DISSERTATION Variable Long-Precision Arithmetic (VLPA) for Recon gurable Coprocessor Architectures

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Quantitative Analysis of Recon gurable Coprocessors for Multimedia Applications

Recently, computer architectures that combine a reconng-urable (or retargetable) coprocessor with a general-purpose microprocessor have been proposed. These architectures are designed to exploit large amounts of ne grain par-allelism in applications. In this paper, we study the performance of the reconngurable coprocessors on multimedia applications. We compare a Field Programmable Gate Array (...

متن کامل

Dynamic Precision Management for Loop Computations on Reconfigurable Architectures

Reconngurable architectures promise signiicant performance beneets by customizing the conngurations to suit the computations. Variable precision for computations is one important method of customization for which reconngurable architectures are well suited. The precision of the operations can be modiied dynamically at run-time to match the precision of the operands. Though the advantages of rec...

متن کامل

Instruction Set Extension for Long Integer Modulo Arithmetic on RISC-Based Smart Cards

Modulo multiplication of long integers (≥ 1024 bits) is the major operation of many public-key cryptosystems like RSA or Diffie-Hellman. The efficient implementation of modulo arithmetic is a challenging task, in particular on smart cards due to their constrained resources and relatively slow clock frequency. In this paper we present the concept of an application-specific instruction set extens...

متن کامل

Architectural Support for Long Integer Modulo Arithmetic on Risc-Based Smart Cards

Various algorithms for public-key cryptography, such as the Rivest–Shamir–Adleman or Diffie–Hellman algorithms, are based on long integer arithmetic operations, most notably modulo multiplication. To be adequate for long-term security, the modulus should have a length of at least 1024 bits. Long integer arithmetic is difficult to implement efficiently in software, particularly on smart cards du...

متن کامل

Variable-precision, interval arithmetic coprocessors

This chapter presents the design and analysis of variable-precision, interval arithmetic processors. The processors give the user the ability to specify the precision of the computation, determine the accuracy of the results, and recompute inaccurate results with higher precision. The processors support a wide variety of arithmetic operations on variable-precision oating point numbers and inter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012